How to solve a timetabling problem by negotiation
نویسندگان
چکیده
Problems involving resource allocation such as appointment taking or timetable creation have usually been tackled as constraint satisfaction problems. For the two aforementioned applications, this forces the users to reveal their agenda in order to give their constraints. But one doesn’t always want to reveal his private events. Thus a solution is for the users to keep their agenda private and to use negotiation to take appointments or courses. In this article, we present a negotiation based approach for timetable creation. Our aim here is not to present an approach that gives the best results but an original one that is more flexible than others which must restart from scratch at each change in the environment. Using agent based negotiation enables us to dynamically add or remove constraints or agents. We show how to transform the timetabling problem into a negotiation problem between agents. Note that an agent can represent a person as well as a thing such as a room. To illustrate our purpose, we use a university timetable creation application. A benchmark has been proposed by the group Asa GDR-I3 [1]. This problem needs, in order to provide a solution, to be able to adapt itself in response to dynamic changes in the environment. This problem needs a collective search of the solution, and isn’t a simulation problem: the aim isn’t to recreate virtually the behaviour of an existing organism, but to furnish an expertise. In order to develop this application, we use a generic negotiation API: GeNCA [2]. This API provides the whole management of negotiation processes and only needs communication configuration and strategy definition. For the application we want to develop, there’ll be no work for communication configuration as we’ll use the provided MAS communication (either Magique or Madkit). Default strategies are also provided with GeNCA which are well-suited for our application. In this paper, we first present the negotiation approach for resource allocation problems and the university timetabling creation application that serves our purpose. Then, we present the negotiation toolkit used to build this application, the way to develop it and the results of this approach.
منابع مشابه
Design of Multi-Agent System for Solution of the School Timetabling Problem
This paper presents the analysis and design of a system based on multi-agent systems (MAS) by negotiation with JADE framework (Java Agent DEvelopment) to solve the school timetabling problem. In the design, the system considers three types of agents; A coordinator agent responsible for instantiate, create and manage the group agents, where the number of teacher and group agents depends on each ...
متن کاملبرنامهریزی درسی در دانشگاه به کمک مدلسازی دو مرحلهای برنامهریزی ریاضی
In the university timetabling problem, necessity of considering variables corresponding to lessons, teachers, classes, days of the week and hours bring about a large scale mix integer linear programming problem. Usually the problem is so big that the exact mathematical programming solvers can not solve them in a small period of time. So variety of heuristic algorithms is proposed to solve such...
متن کاملDistributed personnel scheduling - negotiation among scheduling agents
This paper introduces a model for Distributed Employee Timetabling Problems (DisETPs) and proposes a general architecture for solving DisETPs by using a Multi Agent System (MAS) paradigm. The architecture is composed of a set of autonomous software Scheduling Agents (SAs) that solve the Employee Timetabling Problems (ETP) for each department. Each agent has its own local ETP problem and its own...
متن کاملTransformation of Course Timetablinng Problem to RCPSP
The Resource-Constrained Project Scheduling Problem (RCPSP) is concerned with single-item or small batch production where limited resources have to be allocated to dependent activities over time. Over the past few decades, a lot of work has been made with the use of optimal solution procedures for this basic problem type and its extensions. Brucker and Knust[1] discuss, how timetabling problems...
متن کاملA Study of Genetic Algorithms to Solve the School Timetabling Problem
This paper examines the use of genetic algorithms (GAs) to solve the school timetabling problem. The school timetabling problem falls into the category of NP-hard problems. Instances of this problem vary drastically from school to school and country to country. Previous work in this area has used genetic algorithms to solve a particular school timetabling problem and has not evaluated the perfo...
متن کامل